Some Combinatorial and Analytical Identities

نویسندگان

  • Mourad E.H. Ismail
  • Dennis Stanton
چکیده

We give new proofs and explain the origin of several combinatorial identities of Fu and Lascoux, Dilcher, Prodinger, Uchimura, and Chen and Liu. We use the theory of basic hypergeometric functions, and generalize these identities. We also exploit the theory of polynomial expansions in the Wilson and Askey-Wilson bases to derive new identities which are not in the hierarchy of basic hypergeometric series. We demonstrate that a Lagrange interpolation formula always leads to verywell-poised basic hypergeometric series. As applications we prove that the Watson transformation of a balanced 4φ3 to a very-well-poised 8φ7 is equivalent to the Rodrigues-type formula for the Askey-Wilson polynomials. By applying the Leibniz formula for the Askey-Wilson operator we also establish the 8φ7 summation theorem. Filename: FuLascoux-105. Reference: Annals of Combinatorics, 2011. AMS Subject Classification 2010 Primary: 05A19 and 33D15, Secondary: 05A30 and 33D70.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tilings of a (2× n)-Board and Some New Combinatorial Identities

We know that the Fibonacci numbers count the tilings of a (1×n)-board by squares and dominoes, or equivalently, the number of tilings of a (2×n)-board by dominoes. We use the tilings of a (2×n)-board by colored unit squares and dominoes to obtain some new combinatorial identities. They are generalization of some known combinatorial identities and in the special case give us the Fibonacci identi...

متن کامل

Combinatorial proofs for some forest hook length identities

Chen, Gao and Guo gave in a recent paper many interesting identities involving hook lengths of trees and forests using an extension of Han’s expansion technique. We give combinatorial proofs of some of these identities.

متن کامل

On the Properties of Balancing and Lucas-Balancing $p$-Numbers

The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.

متن کامل

Some Combinatorial Identities and Explanations Based on Occupancy Model

Abstract Some special random variables in occupancy model that balls are distributed into m urns are investigated. The number of occupied urns and the minimal number of balls in all urns are discussed. Some combinatorial identities and their explanations related to the binomial coefficient and Stirling number are derived. Several new infinite summation combinatorial identities on the binomial c...

متن کامل

Combinatorial Proofs of Some Moriarty-type Binomial Coefficient Identities

In this note, we present combinatorial proofs of some Moriarty-type binomial coefficient identities using linear and circular domino arrangements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010